DE ACHTTIENDE-EEUWSE HAAGSE BOEKBAND IN DE KONINKLIJK BIBLIOTHEEK EN HET RIJKSMUSEUM MEERMANNO-WESTREENIANUM LES RELIURES DU 18 S. DE LA HAYE DANS LA KONINKLIJK BIBLIOTHEEK ET LE RIJKSMUSEUM MEERMANNO-WESTREENIANUMSTORM VAN LEEUWEN J.1976, 307 p.Book

THE MEASURE PROBLEM FOR RECTANGULAR RANGES IN D-SPACEVAN LEEUWEN J.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 3; PP. 282-300; BIBL. 8 REF.Article

EFFECTIVE CONSTRUCTIONS IN WELL-PARTIALLY-ORDERED FREE MONOIDS.VAN LEEUWEN J.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 21; NO 3; PP. 237-252; BIBL. 12 REF.Article

ON THE NON-VANISHING TERMS IN A PRODUCT OF MULTIVARIATE POLYNOMIALS.VAN LEEUWEN J.1975; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1975; NO 38; PP. 1-12; BIBL. 1 REF.Article

UEBER PROGRAMMEFFIZIENZ UND ALGEBRAISCHE KOMPLEXITAET = SUR L'EFFICACITE DES PROGRAMMES ET LA COMPLEXITE ALGEBRIQUEVAN LEEUWEN J.1980; INFORM.-SPEKTRUM; DEU; DA. 1980; VOL. 3; NO 3; PP. 172-180; BIBL. 26 REF.Article

THE MEMBERSHIP QUESTION FOR ETOL-LANGUAGES IS POLYNOMIALLY COMPLETE.VAN LEEUWEN J.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 5; PP. 138-143; BIBL. 15 REF.Article

A USEFUL LEMMA FOR CONTEXT-FREE PROGRAMMED GRAMMARSVAN LEEUWEN J.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 4; PP. 373-386; BIBL. 12 REF.Article

RECURSIVELY ENUMERABLE LANGUAGES AND VAN WIJNGAARDEN GRAMMARS.VAN LEEUWEN J.1977; PROC. KKL. NEDERL. AKAD. WETENSCH., A.; NETHERL.; DA. 1977; VOL. 80; NO 1; PP. 29-39; BIBL. 11 REF.Article

THE COMPLEXITY OF DATA ORGANIZATION.VAN LEEUWEN J.1976; IN: FOUND. COMPUT. SCI. ADV. COURSE. 2.; AMSTERDAM; 1976; AMSTERDAM; MATH. CENTRUM; DA. 1976; VOL. 1; PP. 35-147; BIBL. 5 P.Conference Paper

THE TAPE-COMPLEXITY OF CONTEXT-INDEPENDENT DEVELOPMENTAL LANGUAGES.VAN LEEUWEN J.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 2; PP. 203-211; BIBL. 1 P.Article

ON COMPROMISING STATISTICAL DATA-BASES WITH A FEW KNOWN ELEMENTSVAN LEEUWEN J.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 3; PP. 149-153; BIBL. 6 REF.Article

ON EFFICIENTLY COMPUTING THE PRODUCT OF TWO BINARY RELATIONS.VAN LEEUWEN J.1976; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 193-201; BIBL. 12 REF.Article

MAINTENANCE OF CONFIGURATIONS IN THE PLANEOVERMARS MH; VAN LEEUWEN J.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 2; PP. 166-204; BIBL. 31 REF.Conference Paper

OZONATION AT THE STANDER WATER RECLAMATION PLANTVAN LEEUWEN J; PRINSLOO J.1980; WAT. S.A.; ZAF; DA. 1980; VOL. 6; NO 2; PP. 96-102; BIBL. 2 P.Article

ON THE COMPLEXITY OF DECISION TREES, THE QUASI-OPTIMIZER, AND THE POWER OF HEURISTIC RULESFINDLER NV; VAN LEEUWEN J.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 40; NO 1; PP. 1-19; BIBL. 16 REF.Article

THE HALTING PROBLEM FOR LINEAR TURING ASSEMBLERS.BAER RM; VAN LEEUWEN J.1975; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1975; NO 42; PP. 1-26; BIBL. 10 REF.Article

TWO GENERAL METHODS FOR DYNAMIZING DECOMPOSABLE SEARCHING PROBLEMSOVERMARS MH; VAN LEEUWEN J.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 26; NO 2; PP. 155-166; ABS. GER; BIBL. 9 REF.Article

STRATIFIED BALANCED SEARCH TREESVAN LEEUWEN J; OVERMARS MH.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 4; PP. 345-359; BIBL. 10 REF.Article

THE COMPLEXITY OF BASIC COMPLEX OPERATIONSALT H; VAN LEEUWEN J.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 27; NO 3; PP. 205-215; ABS. GER; BIBL. 15 REF.Article

DYNAMICALLY MAINTAINING CONFIGURATIONS IN THE PLANEOVERMARS MH; VAN LEEUWEN J.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 135-145; BIBL. 28 REF.Conference Paper

THE HALTING PROBLEM FOR LINEAR TURING ASSEMBLERS.BAER RM; VAN LEEUWEN J.1976; J. COMPUTER SYST.; U.S.A.; DA. 1976; VOL. 13; NO 2; PP. 119-135; BIBL. 10 REF.Article

AN IMPROVED BOUND FOR DETECTING LOOPING CONFIGURATIONS IN DETERMINISTIC DPA'S.VAN LEEUWEN J; SMITH CH.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 1; PP. 22-24; BIBL. 6 REF.Article

WORST-CASE OPTIMAL INSERTION AND DELETION METHODS FOR DECOMPOSABLE SEARCHING PROBLEMSOVERMARS MH; VAN LEEUWEN J.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 168-173; BIBL. 15 REF.Article

DYNAMIZATION OF DECOMPOSABLE SEARCHING PROBLEMSVAN LEEUWEN J; WOOD D.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 51-56; BIBL. 6 REF.Article

MINER'S RULE WITH RESPECT TO PLAIN CONCRETE = LA REGLE DE MINER EN CE QUI CONCERNE LE BETON NON ARMEVAN LEEUWEN J; SIEMES AJM.1979; HERON; NLD; DA. 1979; VOL. 24; NO 1; PP. 1-34; (31 P.); BIBL. 6 REF.Serial Issue